Tree-Seed Algorithm for Large-Scale Binary Optimization
نویسندگان
چکیده
منابع مشابه
TSA: Tree-seed algorithm for continuous optimization
This paper presents a new intelligent optimizer based on the relation between trees and their seeds for continuous optimization. The new method is in the field of heuristic and population-based search. The location of trees and seeds on n-dimensional search space corresponds with the possible solution of an optimization problem. One or more seeds are produced from the trees and the better seed ...
متن کاملA self-adaptive binary differential evolution algorithm for large scale binary optimization problems
This study proposes a new self-adaptive binary variant of a differential evolution algorithm, based on measure of dissimilarity and named SabDE. It uses an adaptive mechanism for selecting how new trial solutions are generated, and a chaotic process for adapting parameter values. SabDE is compared against a number of existing state of the art algorithms, on a set of benchmark problems including...
متن کاملA HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملA Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization
The unconstrained binary quadratic programming (UBQP) problem is a general NP-hard problem with various applications. In this paper, we present a multilevel algorithm designed to approximate large UBQP instances. The proposed multilevel algorithm is composed of a backbone-based coarsening phase, an asymmetric uncoarsening phase and a memetic refinement phase, where the backbone-based procedure ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KnE Social Sciences
سال: 2018
ISSN: 2518-668X
DOI: 10.18502/kss.v3i1.1396